/*
自己选择的路 ,跪着也要走完。朋友们 , 虽然这个世界日益浮躁起来,只
要能够为了当时纯粹的梦想和感动坚持努力下去 , 不管其它人怎么样,我
们也能够保持自己的本色走下去。
To the world , you will be a person , but to a person , you
will be the world .                               ——AKPower
*/
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;

int main()
{
    int T;
    scanf("%d", &T);
    while (T--)
    {
        int n;
        int cnt1 = 0, cnt2 = 0;
        scanf("%d", &n);
        for (int i = 1; i <= n; i++)
        {
            int tp;
            scanf("%d", &tp);
            if (tp == 1)
                cnt1++;
            else
                cnt2++;
        }
        if (cnt1 % 2 == 0)
        {
            printf("John\n");
        }
        else
        {
            if (cnt1 == 1)
            {
                printf("John\n");
            }
            else
            {
                printf("Brother\n");
            }
        }
    }
    getchar();
    getchar();
    return 0;
}
